Executing A Distributed Java Application On A Plurality Of Compute Nodes

ABSTRACT

Methods, systems, and products are disclosed for executing a distributed Java application on a plurality of compute nodes. The Java application includes a plurality of jobs distributed among the plurality of compute nodes. The plurality of compute nodes are connected together for data communications through a data communication network. Each of the plurality of compute nodes has installed upon it a Java Virtual Machine (‘JVM’) capable of supporting at least one job of the Java application. Executing a distributed Java application on a plurality of compute nodes includes: tracking, by an application manager, a just-in-time (‘JIT’) compilation history for the JVMs installed on the plurality of compute nodes; and configuring, by the application manager, the plurality of jobs for execution on the plurality of compute nodes in dependence upon the JIT compilation history for the JVMs installed on the plurality of compute nodes.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation application of and claims priorityfrom U.S. patent application Ser. No. 12/109,248, filed on Apr. 24,2008.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The field of the invention is data processing, or, more specifically,methods, apparatus, and products for executing a distributed Javaapplication on a plurality of compute nodes.

2. Description Of Related Art

The development of the EDVAC computer system of 1948 is often cited asthe beginning of the computer era. Since that time, computer systemshave evolved into extremely complicated devices. Today's computers aremuch more sophisticated than early systems such as the EDVAC. Computersystems typically include a combination of hardware and softwarecomponents, application programs, operating systems, processors, buses,memory, input/output devices, and so on. As advances in semiconductorprocessing and computer architecture push the performance of thecomputer higher and higher, more sophisticated computer software hasevolved to take advantage of the higher performance of the hardware,resulting in computer systems today that are much more powerful thanjust a few years ago.

Parallel computing is an area of computer technology that hasexperienced advances. Parallel computing is the simultaneous executionof the same task (split up and specially adapted) on multiple processorsin order to obtain results faster. Parallel computing is based on thefact that the process of solving a problem usually can be divided intosmaller tasks, which may be carried out simultaneously with somecoordination.

Parallel computers execute parallel algorithms. A parallel algorithm canbe split up to be executed a piece at a time on many differentprocessing devices, and then put back together again at the end to get adata processing result. Some algorithms are easy to divide up intopieces. Splitting up the job of checking all of the numbers from one toa hundred thousand to see which are primes could be done, for example,by assigning a subset of the numbers to each available processor, andthen putting the list of positive results back together. In thisspecification, the multiple processing devices that execute theindividual pieces of a parallel program are referred to as ‘computenodes.’ A parallel computer is composed of compute nodes and otherprocessing nodes as well, including, for example, input/output (‘I/O’)nodes, and service nodes.

Parallel algorithms are valuable because it is faster to perform somekinds of large computing tasks via a parallel algorithm than it is via aserial (non-parallel) algorithm, because of the way modern processorswork. It is far more difficult to construct a computer with a singlefast processor than one with many slow processors with the samethroughput. There are also certain theoretical limits to the potentialspeed of serial processors. On the other hand, every parallel algorithmhas a serial part and so parallel algorithms have a saturation point.After that point adding more processors does not yield any morethroughput but only increases the overhead and cost.

Parallel algorithms are designed also to optimize one more resource thedata communications requirements among the nodes of a parallel computer.There are two ways parallel processors communicate, shared memory ormessage passing. Shared memory processing needs additional locking forthe data and imposes the overhead of additional processor and bus cyclesand also serializes some portion of the algorithm.

Message passing processing uses high-speed data communications networksand message buffers, but this communication adds transfer overhead onthe data communications networks as well as additional memory need formessage buffers and latency in the data communications among nodes.Designs of parallel computers use specially designed data communicationslinks so that the communication overhead will be small but it is theparallel algorithm that decides the volume of the traffic.

Many data communications network architectures are used for messagepassing among nodes in parallel computers. Compute nodes may beorganized in a network as a ‘torus’ or ‘mesh,’ for example. Also,compute nodes may be organized in a network as a tree. A torus networkconnects the nodes in a three-dimensional mesh with wrap around links.Every node is connected to its six neighbors through this torus network,and each node is addressed by its x,y,z coordinate in the mesh. A torusnetwork lends itself to point to point operations. In a tree network,the nodes typically are connected into a binary tree: each node has aparent, and two children (although some nodes may only have zerochildren or one child, depending on the hardware configuration). Incomputers that use a torus and a tree network, the two networkstypically are implemented independently of one another, with separaterouting circuits, separate physical links, and separate message buffers.A tree network provides high bandwidth and low latency for certaincollective operations, message passing operations where all computenodes participate simultaneously, such as, for example, an allgather.

The parallel applications that execute on the nodes in the datacommunications networks may be implemented in a variety of softwareprogramming languages, including the various versions and derivatives ofJava™ technology promulgated by Sun Microsystems. Java applicationsgenerally run in a virtual execution environment called the Java VirtualMachine (‘JVM’), rather than running directly on the computer hardware.The Java application is typically compiled into byte-code form, and thencompiled in a just-in-time (‘JIT’) manner, or on-the-fly, by the JVMinto JIT code representing hardware commands specific to the hardwareplatform on which the JVM is installed.

In a parallel computer, the Java application is generally a distributedapplication that is composed of multiple jobs; each job implementedusing one or more Java classes. Because the jobs are typically designedin a modular fashion, each job may be utilized in more than one Javaapplication. The JVMs on the compute nodes of the parallel computerprovide an execution environment for the jobs that make up a Javaapplication. As the compute nodes execute the jobs, each compute nodeperforms JIT compilation and optimization of the job supported by thatcompute node's JVM. Each time the Java application executes on theparallel computer, the compute nodes generally have to recompile andre-optimize the byte code representing the jobs of the Java application.Because a particular job may be executed on a parallel computer hundredsor thousands of times in one or more Java applications, valuablecomputing resources are often consumed to repeatedly perform JITcompilation and optimization for the same job regardless of whether thatjob is used repeatedly in the same Java application or different Javaapplications.

SUMMARY OF THE INVENTION

Methods, systems, and products are disclosed for executing a distributedJava application on a plurality of compute nodes. The Java applicationincludes a plurality of jobs distributed among the plurality of computenodes. The plurality of compute nodes are connected together for datacommunications through a data communication network. Each of theplurality of compute nodes has installed upon it a JVM capable ofsupporting at least one job of the Java application. Executing adistributed Java application on a plurality of compute nodes includes:tracking, by an application manager, a JIT compilation history for theJVMs installed on the plurality of compute nodes; and configuring, bythe application manager, the plurality of jobs for execution on theplurality of compute nodes in dependence upon the JIT compilationhistory for the JVMs installed on the plurality of compute nodes.

The foregoing and other objects, features and advantages of theinvention will be apparent from the following more particulardescriptions of exemplary embodiments of the invention as illustrated inthe accompanying drawings wherein like reference numbers generallyrepresent like parts of exemplary embodiments of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an exemplary system for executing a distributed Javaapplication on a plurality of compute nodes according to embodiments ofthe present invention.

FIG. 2 sets forth a block diagram of an exemplary compute node useful ina parallel computer capable of executing a distributed Java applicationon a plurality of compute nodes according to embodiments of the presentinvention.

FIG. 3A illustrates an exemplary Point To Point Adapter useful insystems capable of executing a distributed Java application on aplurality of compute nodes according to embodiments of the presentinvention.

FIG. 3B illustrates an exemplary Global Combining Network Adapter usefulin systems capable of executing a distributed Java application on aplurality of compute nodes according to embodiments of the presentinvention.

FIG. 4 sets forth a line drawing illustrating an exemplary datacommunications network optimized for point to point operations useful insystems capable of executing a distributed Java application on aplurality of compute nodes in accordance with embodiments of the presentinvention.

FIG. 5 sets forth a line drawing illustrating an exemplary datacommunications network optimized for collective operations useful insystems capable of executing a distributed Java application on aplurality of compute nodes in accordance with embodiments of the presentinvention.

FIG. 6 sets forth a block diagram illustrating an exemplary systemuseful in executing a distributed Java application on a plurality ofcompute nodes according to embodiments of the present invention.

FIG. 7 sets forth a flow chart illustrating an exemplary method forexecuting a distributed Java application on a plurality of compute nodesaccording to embodiments of the present invention.

FIG. 8 sets forth a flow chart illustrating a further exemplary methodfor executing a distributed Java application on a plurality of computenodes according to embodiments of the present invention.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

Exemplary methods, apparatus, and computer program products forexecuting a distributed Java application on a plurality of compute nodesaccording to embodiments of the present invention are described withreference to the accompanying drawings, beginning with FIG. 1. FIG. 1illustrates an exemplary system for executing a distributed Javaapplication on a plurality of compute nodes according to embodiments ofthe present invention. The system of FIG. 1 includes a parallel computer(100), non-volatile memory for the computer in the form of data storagedevice (118), an output device for the computer in the form of printer(120), and an input/output device for the computer in the form ofcomputer terminal (122). Parallel computer (100) in the example of FIG.1 includes a plurality of compute nodes (102). The compute nodes (102)are coupled for data communications by several independent datacommunications networks including a Joint Test Action Group (‘JTAG’)network (104), a global combining network (106) which is optimized forcollective operations, and a torus network (108) which is optimizedpoint to point operations. The global combining network (106) is a datacommunications network that includes data communications links connectedto the compute nodes so as to organize the compute nodes as a tree. Eachdata communications network is implemented with data communicationslinks among the compute nodes (102). The data communications linksprovide data communications for parallel operations among the computenodes of the parallel computer. The links between compute nodes arebi-directional links that are typically implemented using two separatedirectional data communications paths.

In addition, the compute nodes (102) of parallel computer are organizedinto at least one operational group (132) of compute nodes forcollective parallel operations on parallel computer (100). Anoperational group of compute nodes is the set of compute nodes uponwhich a collective parallel operation executes. Collective operationsare implemented with data communications among the compute nodes of anoperational group. Collective operations are those functions thatinvolve all the compute nodes of an operational group. A collectiveoperation is an operation, a message-passing computer programinstruction that is executed simultaneously, that is, at approximatelythe same time, by all the compute nodes in an operational group ofcompute nodes. Such an operational group may include all the computenodes in a parallel computer (100) or a subset all the compute nodes.Collective operations are often built around point to point operations.A collective operation requires that all processes on all compute nodeswithin an operational group call the same collective operation withmatching arguments. A ‘broadcast’ is an example of a collectiveoperation for moving data among compute nodes of an operational group. A‘reduce’ operation is an example of a collective operation that executesarithmetic or logical functions on data distributed among the computenodes of an operational group. An operational group may be implementedas, for example, an MPI ‘communicator.’ ‘MPI’ refers to ‘Message PassingInterface,’ a prior art parallel communications library, a module ofcomputer program instructions for data communications on parallelcomputers. Examples of prior-art parallel communications libraries thatmay be improved for use with systems according to embodiments of thepresent invention include MPI and the ‘Parallel Virtual Machine’ (‘PVM’)library. PVM was developed by the University of Tennessee, The Oak RidgeNational Laboratory, and Emory University. MPI is promulgated by the MPIForum, an open group with representatives from many organizations thatdefine and maintain the MPI standard. MPI at the time of this writing isa de facto standard for communication among compute nodes running aparallel program on a distributed memory parallel computer. Thisspecification sometimes uses MPI terminology for ease of explanation,although the use of MPI as such is not a requirement or limitation ofthe present invention.

Some collective operations have a single originating or receivingprocess running on a particular compute node in an operational group.For example, in a ‘broadcast’ collective operation, the process on thecompute node that distributes the data to all the other compute nodes isan originating process. In a ‘gather’ operation, for example, theprocess on the compute node that received all the data from the othercompute nodes is a receiving process. The compute node on which such anoriginating or receiving process runs is referred to as a logical root.

Most collective operations are variations or combinations of four basicoperations: broadcast, gather, scatter, and reduce. The interfaces forthese collective operations are defined in the MPI standards promulgatedby the MPI Forum. Algorithms for executing collective operations,however, are not defined in the MPI standards. In a broadcast operation,all processes specify the same root process, whose buffer contents willbe sent. Processes other than the root specify receive buffers. Afterthe operation, all buffers contain the message from the root process.

In a scatter operation, the logical root divides data on the root intosegments and distributes a different segment to each compute node in theoperational group. In scatter operation, all processes typically specifythe same receive count. The send arguments are only significant to theroot process, whose buffer actually contains sendcount * N elements of agiven data type, where N is the number of processes in the given groupof compute nodes. The send buffer is divided and dispersed to allprocesses (including the process on the logical root). Each compute nodeis assigned a sequential identifier termed a ‘rank.’ After theoperation, the root has sent sendcount data elements to each process inincreasing rank order. Rank 0 receives the first sendcount data elementsfrom the send buffer. Rank 1 receives the second sendcount data elementsfrom the send buffer, and so on.

A gather operation is a many-to-one collective operation that is acomplete reverse of the description of the scatter operation. That is, agather is a many-to-one collective operation in which elements of adatatype are gathered from the ranked compute nodes into a receivebuffer in a root node.

A reduce operation is also a many-to-one collective operation thatincludes an arithmetic or logical function performed on two dataelements. All processes specify the same ‘count’ and the same arithmeticor logical function. After the reduction, all processes have sent countdata elements from computer node send buffers to the root process. In areduction operation, data elements from corresponding send bufferlocations are combined pair-wise by arithmetic or logical operations toyield a single corresponding element in the root process's receivebuffer. Application specific reduction operations can be defined atruntime. Parallel communications libraries may support predefinedoperations. MPI, for example, provides the following pre-definedreduction operations:

MPI_MAX maximum MPI_MIN minimum MPI_SUM sum MPI_PROD product MPI_LANDlogical and MPI_BAND bitwise and MPI_LOR logical or MPI_BOR bitwise orMPI_LXOR logical exclusive or MPI_BXOR bitwise exclusive or

In addition to compute nodes, the parallel computer (100) includesinput/output (‘I/O’) nodes (110, 114) coupled to compute nodes (102)through the global combining network (106). The compute nodes in theparallel computer (100) are partitioned into processing sets such thateach compute node in a processing set is connected for datacommunications to the same I/O node. Each processing set, therefore, iscomposed of one I/O node and a subset of compute nodes (102). The ratiobetween the number of compute nodes to the number of I/O nodes in theentire system typically depends on the hardware configuration for theparallel computer. For example, in some configurations, each processingset may be composed of eight compute nodes and one I/O node. In someother configurations, each processing set may be composed of sixty-fourcompute nodes and one I/O node. Such example are for explanation only,however, and not for limitation. Each I/O nodes provide I/O servicesbetween compute nodes (102) of its processing set and a set of I/Odevices. In the example of FIG. 1, the I/O nodes (110, 114) areconnected for data communications I/O devices (118, 120, 122) throughlocal area network (‘LAN’) (130) implemented using high-speed Ethernet.

The parallel computer (100) of FIG. 1 also includes a service node (116)coupled to the compute nodes through one of the networks (104). Servicenode (116) provides services common to pluralities of compute nodes,administering the configuration of compute nodes, loading programs intothe compute nodes, starting program execution on the compute nodes,retrieving results of program operations on the computer nodes, and soon. Service node (116) runs a service application (124) and communicateswith users (128) through a service application interface (126) that runson computer terminal (122).

In the example of FIG. 1, the service node (116) has installed upon itan application manager (125). The application manager (125) of FIG. 1includes a set of computer program instructions capable of executing adistributed Java application on a plurality of compute nodes accordingto embodiments of the present invention. The Java application includes aplurality of jobs distributed among the plurality of compute nodes (102)for execution. The application manager (125) operates generally forexecuting a distributed Java application on a plurality of compute nodesaccording to embodiments of the present invention by: tracking a JITcompilation history for the JVMs (200) installed on the plurality ofcompute nodes (102); and configuring the plurality of jobs for executionon the plurality of compute nodes (102) in dependence upon the JITcompilation history for the JVMs (200) installed on the plurality ofcompute nodes (102). Although FIG. 1 illustrates the application manager(125) installed on a service node, readers will note that such anexample is for explanation only and not for limitation. An applicationmanager is a software component that may be installed on any computenodes or other computer as will occur to those of skill in the art.

The JIT compilation history represents a historical record of theSitting performed by a particular JVM. The terms ‘jit,’ ‘jitting,’ or‘jitted’ refer to a JVM's process of translating byte code into nativeplatform machine code executable on the platform's processor andoptimizing the machine code for enhanced execution performance. The JITcompilation history typically specifies the portion of the jobs jittedby the JVM and the JIT level at which the jitting on those portions wasperformed. The job portions identified in the JIT compilation historymay be Java classes, methods, call sequences for methods, and so on.Accordingly, the JIT compilation history may include JIT levels for Javaconstructs processed on the plurality of compute nodes (102) or JITlevels for Java call sequences for particular Java methods processed onthe plurality of compute nodes (102).

A JIT level, also referred to as a ‘JIT mode,’ specifies the type of JITcompiling and optimizations performed on a particular portion of a Javaapplication. The number and type of JIT levels available for a JVM varyfrom one implementation to another. For one example, Sun Microsystems'JVM has two major JIT levels—client and server. In the client JIT level,minimal compilation and optimization is performed in an effort to reducethe startup time required for the application to begin executing. In theserver JIT level, initial startup time is sacrificed, and extensivecompilation and optimization is performed to maximize applicationperformance when the application executes. Readers will note that thesetwo JIT level are for example and explanation only and not forlimitations. Other JIT levels and other terms besides ‘client’ and‘server’ may be used to identify JIT level as will occur to those ofskill in the art.

Each compute node (102) of FIG. 1 has installed upon it a Java VirtualMachine (‘JVM’) (200) capable of supporting a Java application. Each JVM(200) of FIG. 1 includes a set of computer program instructions capableof executing a distributed Java application on a plurality of computenodes according to embodiments of the present invention. Each JVM (200)operates generally for executing a distributed Java application on aplurality of compute nodes according to embodiments of the presentinvention by: recording the JIT compilation history for the jobssupported by that JVM and providing the recorded JIT compilation historyto the application manager (125).

In the example of FIG. 1, the plurality of compute nodes (102) areimplemented in a parallel computer (100) and are connected togetherusing a plurality of data communications networks (104, 106, 108). Thepoint to point network (108) is optimized for point to point operations.The global combining network (106) is optimized for collectiveoperations. Although executing a distributed Java application on aplurality of compute nodes according to embodiments of the presentinvention is described above in terms of executing a distributed Javaapplication on a parallel computer, readers will note that such anembodiment is for explanation only and not for limitation. In fact,executing a distributed Java application on a plurality of compute nodesaccording to embodiments of the present invention may be implementedusing a variety of computer systems composed of a plurality of nodesnetwork-connected together, including for example a cluster of nodes, adistributed computing system, a grid computing system, and so on.

The arrangement of nodes, networks, and I/O devices making up theexemplary system illustrated in FIG. 1 are for explanation only, not forlimitation of the present invention. Data processing systems capable ofexecuting a distributed Java application on a plurality of compute nodesaccording to embodiments of the present invention may include additionalnodes, networks, devices, and architectures, not shown in FIG. 1, aswill occur to those of skill in the art. Although the parallel computer(100) in the example of FIG. 1 includes sixteen compute nodes (102),readers will note that parallel computers capable of executing adistributed Java application on a plurality of compute nodes accordingto embodiments of the present invention may include any number ofcompute nodes. In addition to Ethernet and JTAG, networks in such dataprocessing systems may support many data communications protocolsincluding for example TCP (Transmission Control Protocol), IP (InternetProtocol), and others as will occur to those of skill in the art.Various embodiments of the present invention may be implemented on avariety of hardware platforms in addition to those illustrated in FIG.1.

Executing a distributed Java application on a plurality of compute nodesaccording to embodiments of the present invention may be generallyimplemented on a parallel computer that includes a plurality of computenodes, among other types of exemplary systems. In fact, such computersmay include thousands of such compute nodes. Each compute node is inturn itself a kind of computer composed of one or more computerprocessors, its own computer memory, and its own input/output adapters.For further explanation, therefore, FIG. 2 sets forth a block diagram ofan exemplary compute node (152) useful in a parallel computer capable ofexecuting a distributed Java application on a plurality of compute nodesaccording to embodiments of the present invention.

The compute node (152) of FIG. 2 includes one or more computerprocessors (164) as well as random access memory (‘RAM’) (156). Theprocessors (164) are connected to RAM (156) through a high-speed memorybus (154) and through a bus adapter (194) and an extension bus (168) toother components of the compute node (152). Stored in RAM (156) is a job(158) of a Java application distributed across the nodes of the parallelcomputer. The job (158) is a module of computer program instructions,typically represented in byte code, that carries out parallel,user-level data processing using one or more Java classes.

Also stored in RAM (156) is an application manager (125). Theapplication manager (125) of FIG. 2 includes a set of computer programinstructions capable of executing a distributed Java application on aplurality of compute nodes according to embodiments of the presentinvention. The application manager (125) operates generally forexecuting a distributed Java application on a plurality of compute nodesaccording to embodiments of the present invention by: tracking a JITcompilation history for the JVMs installed on the plurality of computenodes in the parallel computer and configuring the plurality of jobs forexecution on the plurality of compute nodes in dependence upon the JITcompilation history for the JVMs installed on the plurality of computenodes.

Also stored in RAM (156) is a network monitor (201) that monitors theutilization of each of the nodes and the data communication networksconnecting the nodes together. The network monitors on the compute nodescommunicate with one another to keep all of the nodes and any servicenodes informed about the state of the individual nodes and the networks.In addition, the network monitor (201) may be used to facilitate theexchange of JIT compilation histories between the JVMs installed on thecompute nodes and the application manager (125). To facilitate suchcommunications each network monitor may register with the applicationmanager (125) and expose and interface to the JVM through which the JVMcan update the application manager (125) with the JVM's JIT compilationhistory. In such a manner, the network monitor (201) may serve a ‘localclient’ for the application manager (125) on each of the nodes.

Also stored in RAM (156) is a JVM (200). The JVM (200) of FIG. 2 is aset of computer software programs and data structures which implements avirtual execution environment for a specific hardware platform. The JVM(200) of FIG. 2 accepts the Java application (158) for execution in acomputer intermediate language, commonly referred to as Java byte code,which is a hardware-independent compiled form of the Java application(158). In such a manner, the JVM (200) of FIG. 2 serves to abstract thecompiled version of the Java application (158) from the hardware of node(152) because the JVM (200) handles the hardware specific implementationdetails of executing the application (158) during runtime. Abstractingthe hardware details of a platform from the compiled form of a Javaapplication allows the application to be compiled once into byte code,yet run on a variety of hardware platforms.

The JVM (200) of FIG. 2 is improved for executing a distributed Javaapplication on a plurality of compute nodes according to embodiments ofthe present invention. The JVM (200) of FIG. 2 operates generally forexecuting a distributed Java application on a plurality of compute nodesaccording to embodiments of the present invention by: recording the JITcompilation history for the jobs supported by that JVM (200) andproviding the recorded JIT compilation history to the applicationmanager (125).

Also stored RAM (156) is a messaging module (161), a library of computerprogram instructions that carry out parallel communications amongcompute nodes, including point to point operations as well as collectiveoperations. The Java application (158) effects data communications withother applications running on other compute nodes by calling softwareroutines in the messaging modules (161). A library of parallelcommunications routines may be developed from scratch for use in systemsaccording to embodiments of the present invention, using a traditionalprogramming language such as the C programming language, and usingtraditional programming methods to write parallel communicationsroutines. Alternatively, existing prior art libraries may be used suchas, for example, the ‘Message Passing Interface’ (‘MPI’) library, the‘Parallel Virtual Machine’ (‘PVM’) library, and the Aggregate RemoteMemory Copy Interface (‘ARMCI’) library.

Also stored in RAM (156) is an operating system (162), a module ofcomputer program instructions and routines for an application program'saccess to other resources of the compute node. It is typical for anapplication program and parallel communications library in a computenode of a parallel computer to run a single thread of execution with nouser login and no security issues because the thread is entitled tocomplete access to all resources of the node. The quantity andcomplexity of tasks to be performed by an operating system on a computenode in a parallel computer therefore are smaller and less complex thanthose of an operating system on a serial computer with many threadsrunning simultaneously. In addition, there is no video I/O on thecompute node (152) of FIG. 2, another factor that decreases the demandson the operating system. The operating system may therefore be quitelightweight by comparison with operating systems of general purposecomputers, a pared down version as it were, or an operating systemdeveloped specifically for operations on a particular parallel computer.Operating systems that may usefully be improved, simplified, for use ina compute node include UNIX™, Linux™, Microsoft Vista™, AIX™, IBM'si5/OS™, and others as will occur to those of skill in the art.

The exemplary compute node (152) of FIG. 2 includes severalcommunications adapters (172, 176, 180, 188) for implementing datacommunications with other nodes of a parallel computer. Such datacommunications may be carried out serially through RS-232 connections,through external buses such as USB, through data communications networkssuch as IP networks, and in other ways as will occur to those of skillin the art. Communications adapters implement the hardware level of datacommunications through which one computer sends data communications toanother computer, directly or through a network. Examples ofcommunications adapters useful in systems for executing a distributedJava application on a plurality of compute nodes according toembodiments of the present invention include modems for wiredcommunications, Ethernet (IEEE 802.3) adapters for wired networkcommunications, and 802.11b adapters for wireless networkcommunications.

The data communications adapters in the example of FIG. 2 include aGigabit Ethernet adapter (172) that couples example compute node (152)for data communications to a Gigabit Ethernet (174). Gigabit Ethernet isa network transmission standard, defined in the IEEE 802.3 standard,that provides a data rate of 1 billion bits per second (one gigabit).Gigabit Ethernet is a variant of Ethernet that operates over multimodefiber optic cable, single mode fiber optic cable, or unshielded twistedpair.

The data communications adapters in the example of FIG. 2 includes aJTAG Slave circuit (176) that couples example compute node (152) fordata communications to a JTAG Master circuit (178). JTAG is the usualname used for the IEEE 1149.1 standard entitled Standard Test AccessPort and Boundary-Scan Architecture for test access ports used fortesting printed circuit boards using boundary scan. JTAG is so widelyadapted that, at this time, boundary scan is more or less synonymouswith JTAG. JTAG is used not only for printed circuit boards, but alsofor conducting boundary scans of integrated circuits, and is also usefulas a mechanism for debugging embedded systems, providing a convenient“back door” into the system. The example compute node of FIG. 2 may beall three of these: It typically includes one or more integratedcircuits installed on a printed circuit board and may be implemented asan embedded system having its own processor, its own memory, and its ownI/O capability. JTAG boundary scans through JTAG Slave (176) mayefficiently configure processor registers and memory in compute node(152) for use in executing a distributed Java application on a pluralityof compute nodes according to embodiments of the present invention.

The data communications adapters in the example of FIG. 2 includes aPoint To Point Adapter (180) that couples example compute node (152) fordata communications to a network (108) that is optimal for point topoint message passing operations such as, for example, a networkconfigured as a three-dimensional torus or mesh. Point To Point Adapter(180) provides data communications in six directions on threecommunications axes, x, y, and z, through six bidirectional links: +x(181), −x (182), +y (183), —y (184), +z (185), and −z (186).

The data communications adapters in the example of FIG. 2 includes aGlobal Combining Network Adapter (188) that couples example compute node(152) for data communications to a network (106) that is optimal forcollective message passing operations on a global combining networkconfigured, for example, as a binary tree. The Global Combining NetworkAdapter (188) provides data communications through three bidirectionallinks: two to children nodes (190) and one to a parent node (192).

Example compute node (152) includes two arithmetic logic units (‘ALUs’).ALU (166) is a component of processor (164), and a separate ALU (170) isdedicated to the exclusive use of Global Combining Network Adapter (188)for use in performing the arithmetic and logical functions of reductionoperations. Computer program instructions of a reduction routine inparallel communications library (160) may latch an instruction for anarithmetic or logical function into instruction register (169). When thearithmetic or logical function of a reduction operation is a ‘sum’ or a‘logical or,’ for example, Global Combining Network Adapter (188) mayexecute the arithmetic or logical operation by use of ALU (166) inprocessor (164) or, typically much faster, by use dedicated ALU (170).

The example compute node (152) of FIG. 2 includes a direct memory access(DMA') controller (195), which is computer hardware for direct memoryaccess and a DMA engine (195), which is computer software for directmemory access. Direct memory access includes reading and writing tomemory of compute nodes with reduced operational burden on the centralprocessing units (164). A DMA transfer essentially copies a block ofmemory from one compute node to another. While the CPU may initiates theDMA transfer, the CPU does not execute it. In the example of FIG. 2, theDMA engine (195) and the DMA controller (195) support the messagingmodule (161).

For further explanation, FIG. 3A illustrates an exemplary Point To PointAdapter (180) useful in systems capable of executing a distributed Javaapplication on a plurality of compute nodes according to embodiments ofthe present invention. Point To Point Adapter (180) is designed for usein a data communications network optimized for point to pointoperations, a network that organizes compute nodes in athree-dimensional torus or mesh. Point To Point Adapter (180) in theexample of FIG. 3A provides data communication along an x-axis throughfour unidirectional data communications links, to and from the next nodein the −x direction (182) and to and from the next node in the +xdirection (181). Point To Point Adapter (180) also provides datacommunication along a y-axis through four unidirectional datacommunications links, to and from the next node in the −y direction(184) and to and from the next node in the +y direction (183). Point ToPoint Adapter (180) in FIG. 3A also provides data communication along az-axis through four unidirectional data communications links, to andfrom the next node in the −z direction (186) and to and from the nextnode in the +z direction (185).

For further explanation, FIG. 3B illustrates an exemplary GlobalCombining Network Adapter (188) useful in systems capable of executing adistributed Java application on a plurality of compute nodes accordingto embodiments of the present invention. Global Combining NetworkAdapter (188) is designed for use in a network optimized for collectiveoperations, a network that organizes compute nodes of a parallelcomputer in a binary tree. Global Combining Network Adapter (188) in theexample of FIG. 3B provides data communication to and from two childrennodes through four unidirectional data communications links (190).Global Combining Network Adapter (188) also provides data communicationto and from a parent node through two unidirectional data communicationslinks (192).

For further explanation, FIG. 4 sets forth a line drawing illustratingan exemplary data communications network (108) optimized for point topoint operations useful in systems capable of executing a distributedJava application on a plurality of compute nodes in accordance withembodiments of the present invention. In the example of

FIG. 4, dots represent compute nodes (102) of a parallel computer, andthe dotted lines between the dots represent data communications links(103) between compute nodes. The data communications links areimplemented with point to point data communications adapters similar tothe one illustrated for example in FIG. 3A, with data communicationslinks on three axes, x, y, and z, and to and fro in six directions +x(181), −x (182), +y (183), −y (184), +z (185), and −z (186). The linksand compute nodes are organized by this data communications networkoptimized for point to point operations into a three dimensional mesh(105). The mesh (105) has wrap- around links on each axis that connectthe outermost compute nodes in the mesh (105) on opposite sides of themesh (105). These wrap-around links form part of a torus (107). Eachcompute node in the torus has a location in the torus that is uniquelyspecified by a set of x, y, z coordinates. Readers will note that thewrap-around links in the y and z directions have been omitted forclarity, but are configured in a similar manner to the wrap-around linkillustrated in the x direction. For clarity of explanation, the datacommunications network of FIG. 4 is illustrated with only 27 computenodes, but readers will recognize that a data communications networkoptimized for point to point operations for use in executing adistributed Java application on a plurality of compute nodes inaccordance with embodiments of the present invention may contain only afew compute nodes or may contain thousands of compute nodes.

For further explanation, FIG. 5 sets forth a line drawing illustratingan exemplary data communications network (106) optimized for collectiveoperations useful in systems capable of executing a distributed Javaapplication on a plurality of compute nodes in accordance withembodiments of the present invention. The example data communicationsnetwork of FIG. 5 includes data communications links connected to thecompute nodes so as to organize the compute nodes as a tree. In theexample of FIG. 5, dots represent compute nodes (102) of a parallelcomputer, and the dotted lines (103) between the dots represent datacommunications links between compute nodes. The data communicationslinks are implemented with global combining network adapters similar tothe one illustrated for example in FIG. 3B, with each node typicallyproviding data communications to and from two children nodes and datacommunications to and from a parent node, with some exceptions. Nodes ina binary tree (106) may be characterized as a physical root node (202),branch nodes (204), and leaf nodes (206). The root node (202) has twochildren but no parent. The leaf nodes (206) each has a parent, but leafnodes have no children. The branch nodes (204) each has both a parentand two children. The links and compute nodes are thereby organized bythis data communications network optimized for collective operationsinto a binary tree (106). For clarity of explanation, the datacommunications network of FIG. 5 is illustrated with only 31 computenodes, but readers will recognize that a data communications networkoptimized for collective operations for use in systems for executing adistributed Java application on a plurality of compute nodes inaccordance with embodiments of the present invention may contain only afew compute nodes or may contain thousands of compute nodes.

In the example of FIG. 5, each node in the tree is assigned a unitidentifier referred to as a ‘rank’ (250). A node's rank uniquelyidentifies the node's location in the tree network for use in both pointto point and collective operations in the tree network. The ranks inthis example are assigned as integers beginning with 0 assigned to theroot node (202), 1 assigned to the first node in the second layer of thetree, 2 assigned to the second node in the second layer of the tree, 3assigned to the first node in the third layer of the tree, 4 assigned tothe second node in the third layer of the tree, and so on. For ease ofillustration, only the ranks of the first three layers of the tree areshown here, but all compute nodes in the tree network are assigned aunique rank.

For further explanation, FIG. 6 sets forth a block diagram illustratingan exemplary system useful in executing a distributed Java application(601) on a plurality of compute nodes (600 a) according to embodimentsof the present invention. The Java application (601) of FIG. 6 includesa plurality of jobs (158) distributed among the plurality of computenodes (600). Each compute node (600) has installed upon it a JVM (200)capable of supporting at least one job (158) of the Java application(601).

The nodes (600) of FIG. 6 are connected together for data communicationsusing a data communication network. In addition, the nodes (600) areconnected to an I/O node (110) that provides I/O services between thenodes (600) and a set of I/O devices such as, for example, the servicenode (116) and the data storage (118). The service node (116) of FIG. 6provides services common to nodes (600), administering the configurationof nodes (600), loading programs such as Java application (601) and JVM(200) onto the nodes (600), starting program execution on the nodes(600), retrieving results of program operations on the nodes (600), andso on. The data storage (118) of FIG. 6 may store the files that containthe Java classes that compose the Java application (601).

The service node (116) has installed upon it an application manager(125). The application manager (125) includes a set of computer programinstructions capable of executing a distributed Java application on aplurality of compute nodes according to embodiments of the presentinvention. The application manager (125) operates generally forexecuting a distributed Java application on a plurality of compute nodesaccording to embodiments of the present invention by: tracking a JITcompilation history (652) for the JVMs (200) installed on the pluralityof compute nodes (600) and configuring the plurality of jobs (158) forexecution on the plurality of compute nodes (600) in dependence upon theJIT compilation history (652) for the JVMs (200) installed on theplurality of compute nodes (600). In such a manner, the applicationmanager (125) may configure a job (158) of the application (601) forexecution on a compute node (600) that has already jitted thatparticular job at a desired JIT level specified by a JIT profile (603)for the application (601). The node (600) may have already jitted thatparticular job because the Java application (601) has already beenexecuted on the nodes (600) or that particular job may have been part ofanother Java application that has already been executed on the nodes(600).

In the example of FIG. 6, the JIT profile (603) of FIG. 6 is a datastructure used by the application manager (125) that associates JITlevels with various jobs (158) of the application (601). The JIT profile(603) may be formatted as a text file, a table, a structured document,or any other format as will occur to those of skill in the art. Inaddition to using the JIT profile (603) to configure jobs (158) on thenodes (600), the application manager (125) may also be used to assignJIT levels to the various jobs (158) of application (601) in a JITprofile (603). The application manager (125) may assign JIT levels tothe various jobs (158) of application (601) based on user-specified JITlevels for the various jobs (158) of the application (601) or based on ahistoric execution performance for the various jobs (158) of theapplication (601).

The level of granularity at which the application manager (125) assignsJIT levels to a job (158) may vary from one embodiment to another. Theapplication manager (125) may assign a single JIT level to an entire job(158), or the application manager (125) may assign multiple JIT level toa single job (158) such that different portions of the job (158) havedifferent JIT levels. When a JIT level is assigned to a portion of a job(158), the portion may be a generic Java construct, a specificimplementation of a Java construct, a call sequence for a particularJava method, and so on. A generic Java construct is a Java specificprogramming structure such as, for example, a class, a packet, a method,a Java Archive, and so on. A specific implementation of a Java constructis an actual instance of a generic type of Java construct. For example,foo( ) is an example of a specific implementation of a Java method. Acall sequence for a particular Java method is the set of instructions inthe execution path for a particular Java method from the method'sbeginning to the method's end. That is, call sequence for a particularJava method includes all of the computer program instructions in thatparticular method and any instructions of the methods invoked by thatparticular method.

Using these different exemplary job portions, the application manager(125) of FIG. 6 may assign a different JIT level to any one of thesegeneric types of Java constructs, specific implementations of Javaconstructs, or call sequences for a particular Java method. For furtherexplanation, consider that a job (158) includes a Java Archive (‘JAR’)file that, in turn, includes a variety of Java classes. Consider thatone of these Java classes is called Too class,' and foo_class includes amethod called ‘foo_method,’ which in turn calls a method named‘foo2_method.’ Further consider that the JIT levels available to aparticular JVM are ‘low,’ medium,’ ‘high,’ and ‘ultra high.’ In such anexample, the application manager (125) may assign a JIT level of low tothe entire exemplary Java Archive file, a JIT level of medium tofoo class, a JIT level of high to foo_method, and a JIT level of ultrahigh to foo2_method. In such a manner, different portions of theexemplary job are assigned different JIT levels.

In the example of FIG. 6, the application manager (125) configures job(158 a) on compute node (600 a) for execution based on the JITcompilation history (652 a) for the JVM (200) on node (600 a). Toexecute the job (158 a), the JVM (200) of FIG. 6 includes a JIT compiler(618) and JIT code executor (654). The JIT compiler (618) compiles thebyte code representation of job (158 a) into machine code to be rundirectly on the native platform and optimizes the machine code forenhanced performance. The JIT compiler (618) is typically invoked whenthe job (158 a) is started up or when some other usage criterion is metto improve run-time performance by avoiding the need for this code to beinterpreted later. The output from the JIT compiler (618) is JIT code(616), which is in turn provided into the JIT code executor (654) forexecution on the platform's processor.

The JIT compiler (618) operates by spawning a compilation thread thatreceives the byte-code version of the job (158 a), translates andoptimizes the byte code into native code, and feeds the native code toan execution thread for the JIT code executor (654). After processingvarious portions of the job (158 a), the JIT compiler (618) examines theportions of the job (158 a) executed by the JIT code executor (654). TheJIT compiler (618) may update the JIT compilation history (652 a) forthe JVM (200) based on how the JIT code executor (654) executed the job(158 a). For example, if portions of the job (158 a) are consistentlybeing skipped during execution, the JIT compiler (618) may record in theJIT compilation history (652 a) that those portions are often skippedduring execution. Similarly, if portions of the job (158 a) are beingexecuted repeatedly, the JIT compiler (618) may record in the JITcompilation history (652 a) for the JVM (200) that those portions arerepeatedly executed. In such a manner, the JIT compiler (618) of FIG. 6operates generally for executing a distributed Java application on aplurality of compute nodes according to embodiments of the presentinvention by recording the JIT compilation history (652 a) for the job(158 a) supported by the JVM (200) and providing the recorded JITcompilation history (652 a) to the application manager (125). The JVM(200) may communicate with the application manager (125) through thenetwork monitor (201). The application manager (125) may then in turnutilize the JIT compilation history (652) received from each of the JVMssupporting the jobs (158) to configure the jobs (158) in the future onthe nodes (600) that have already jitted the jobs (158) at desired JITlevels.

The job (158 a) of the application (601) often represents any number ofJava classes. As the JVM (200) executes the job (158 a), the JVMidentifies a Java class utilized for the job (158 a), loads the Javaclasses for the job (158 a) into memory, and prepares each classinstance for execution. The JVM (200) therefore includes a hierarchy ofclass loaders (620) that operate to load the classes specified by thejob (158 a). The hierarchy of class loaders (620) includes a primordialclass loader (622), an extension class loader (624), and an applicationclass loader (626).

The primordial class loader (622) of FIG. 6 loads the core Javalibraries, such as ‘core.jar,”server.jar,’ and so on, in the‘<JAVA_HOME>/lib’ directory. The primordial class loader (622), which ispart of the core JVM, is written in native code specific to the hardwareplatform on which the JVM is installed. The extension class loader (624)of FIG. 6 loads the code in the extensions directories and is typicallyimplemented by the ‘sun.misc.Launcher$ExtClassLoader’ class. Theapplication class loader (626) of FIG. 6 loads the class specified by‘java.class.path,’ which maps to the system ‘CLASSPATH’ variable. Theapplication class loader (626) is typically implemented by the‘sun.misc.Launcher$AppClassLoader’ class.

For each class included or specified by the job (158 a), the JVM (200)effectively traverses up the class loader hierarchy to determine whetherany class loader has previously loaded the class. The order of traversalis as follows: first to the default application class loader (626), thento the extension class loader (624), and finally to the primordial classloader (622). If the response from all of the class loaders is negative,then the JVM (200) traverses down the hierarchy, with the primordialclass loader first attempting to locate the class by searching thelocations specified in its class path definition. If the primordialclass loader (622) is unsuccessful, then the then the extension classloader (624) may make a similar attempt to load the class. If theextension class loader (624) is unsuccessful, then the application classloader (626) attempts to load the class. Finally, if the applicationclass loader (626) is unsuccessful, then the JVM (200) triggers an errorcondition.

The JVM (200) of FIG. 6 also includes a heap (610), which is sharedbetween all threads, and is used for storage of objects (612). Eachobject (612) represents an already loaded class. That is, each object(612) is in effect an instantiation of a class, which defines theobject. Because a job may utilize more than one object of the same type,a single class may be instantiated multiple times to create the objectsspecified by the job (158 a). Readers will note that the class loaders(620) are objects that are also stored on heap (610), but for the sakeof clarity the class loaders (620) are shown separately in FIG. 6.

In the example of FIG. 6, the JVM (200) also includes a class storagearea (636), which is used for storing information relating to theclasses stored in the heap (610). The class storage area (636) includesa method code region (638) for storing byte code for implementing classmethod calls, and a constant pool (640) for storing strings and otherconstants associated with a class. The class storage area (636) alsoincludes a field data region (642) for sharing static variables, whichare shared between all instances of a class, and a static initializationarea (646) for storing static initialization methods and otherspecialized methods separate from the method code region (638). Theclass storage area also includes a method block area (644), which isused to stored information relating to the code, such as invokers, and apointer to the code, which may for example be in method code area (638),in JIT code area (616) described above, or loaded as native code suchas, for example, a dynamic link library (‘DLL’) written in C or C++.

A class stored as an object (612) in the heap (610) contains a referenceto its associated data, such as method byte code, in class storage area(636). Each object (612) contains a reference to the class loader (620),which loaded the class into the heap (610), plus other fields such as aflag to indicate whether or not they have been initialized.

In the example of FIG. 6, the JVM (200) also includes a stack area(614), which is used for storing the stacks associated with theexecution of different threads on the JVM (200). Readers will note thatbecause the system libraries and indeed parts of the JVM (200) itselfare written in Java, which frequently utilize multi-threading, the JVM(200) may be supporting multiple threads even if the job (158 a)contains only a single thread.

Also included within JVM (200) of FIG. 6 is a class loader cache (634)and garbage collector (650). The former is typically implemented as atable that allows a class loader to trace those classes which itinitially loaded into the JVM (200). The class loader cache (634)therefore allows each class loader (620) to determine whether it hasalready loaded a particular class when the JVM (200) initially traversesthe class loader hierarchy as described above. Readers will note that itis part of the overall security policy of the JVM (200) that classeswill typically have different levels of permission within the systembased on the identity of the class loader by which they were originallyloaded.

The garbage collector (650) is used to delete objects (612) from heap(610) when they are no longer required. Thus in the Java programminglanguage, applications do not need to specifically request or releasememory, rather this is controlled by the JVM (200) itself. Therefore,when the job (158a) specifies the creation of an object (612), the JVM(200) secures the requisite memory resource. Then, when the job (158 a)finishes using object (612), the JVM (200) can delete the object (612)to free up this memory resource. This process of deleting an object isknown as ‘garbage collection,’ and is generally performed by brieflyinterrupting all threads on the stack (614), and scanning the heap (610)for objects (612) which are no longer referenced, and therefore can bedeleted. The details of garbage collection vary from one JVM (200)implementation to another, but typically garbage collection is scheduledwhen the heap (610) is nearly exhausted and so there is a need to freeup space for new objects (612).

In the example of FIG. 6, the JVM (200) also includes a monitor pool(648). The monitor pool (648) is used to store a set of locks or‘monitors’ that are used to control contention to an object resultingfrom concurrent attempts to access the object by different threads whenexclusive access to the object is required.

Although the JVM (200) in FIG. 6 is shown on and described above withregard to the node (600 a), readers will note that each of the othernodes (600 b) also has installed upon it a JVM configured in a similarmanner. That is, each of the other nodes (600 b) also has installed uponit a JVM capable of executing a distributed Java application on aplurality of compute nodes according to embodiments of the presentinvention.

For further explanation, FIG. 7 sets forth a flow chart illustrating anexemplary method for executing a distributed Java application (601) on aplurality of compute nodes (600) according to embodiments of the presentinvention. The Java application (601) includes a plurality of jobs (158)distributed among the plurality of compute nodes (600). The plurality ofcompute nodes (600) connected together for data communications through adata communication network. Each of the plurality of compute nodes (600)has installed upon it a JVM capable of supporting at least one job (158)of the Java application (601).

The method of FIG. 7 includes tracking (700), by an application manager,a JIT compilation history (652) for the JVMs installed on the pluralityof compute nodes. The application manager may track (700) a JITcompilation history (652) for the JVMs installed on the plurality ofcompute nodes according to the method of FIG. 7 by receiving the JITcompilation history (652) from each of the JVMs installed on the computenodes (600). The application manager may receive the JIT compilationhistory (652) as each of the JVMs transmit its JIT compilation history(652) periodically to the application manager. In some otherembodiments, however, the application manager may periodically poll eachof the JVMs for the JIT compilation history (652). The applicationmanager and the JVMs may communicate directly with each other or throughsome intermediary communications facilitator such as, for example, anetwork monitor.

The JIT compilation history (652) of FIG. 7 represents a historicalrecord of the jitting performed by JVMs installed on the plurality ofnodes (600). A JIT compilation history (652) for a JVM typicallyspecifies the portion of the jobs jitted by the JVM and the JIT level atwhich the jitting on those portions was performed. Because the jobportions identified in the JIT compilation history may be Javaconstructs or call sequences for particular Java methods, the JITcompilation history may specify JIT levels for Java constructs or JITlevels for Java call sequences for particular Java methods. For example,consider the following pseudo code representing an exemplary jobexecuting on one of the nodes:

01: ... 02: public class FooClass { 03: static void foo2(...) { 04: ...05: return; 06: } 07: static void foo(...) { 08: ... 09:FooClass.foo2(...); 10: ... 11: return; 12: ... 13: public static voidmain (String[ ] args) { 14: ... 15: while (test) { 16:FooClass.foo(...); 17: } 18: ... 19:SomeOtherClass.someOtherMethod(...); 20: ... 21: } 22: } 23: ...

The pseudo code above references three Java classes ‘FooClass,’ ‘main,’and ‘SomeOtherClass.’ The main class invokes a member method of FooClasscalled ‘foo’ within a while loop and a member method of SomeOtherClasscalled ‘someOtherMethod.’ In turn, the foo method invokes another membermethod of the FooClass called ‘foo2.’ Readers will note that theexemplary Java application represented by the pseudo code above is forexplanation only and not for limitation.

Now consider an exemplary JIT compilation history for the JVM supportingthe exemplary job above where the JIT levels are low, medium, high, andultra high for the various portions within the job:

TABLE 1 EXEMPLARY JIT COMPILATION HISTORY JOB PORTION IDENTIFIER JITLEVEL FooClass Ultra High foo2 Ultra High foo Ultra High main MediumSomeOtherClass Ultra High someOtherMethod Ultra High while loop UltraHigh Java Classes Medium Java Methods Medium Call Sequence foo UltraHigh

The exemplary JIT compilation history above indicates the JVM supportingthe exemplary job above jitted the Java constructs FooClass, foo2, foo,SomeOtherClass, someOtherMethod, and the while loop at a JIT level ofultra high. The exemplary JIT compilation history above also indicatesthe JVM supporting the exemplary job above jitted the generic Java classand method constructs and the specific Java construct main at a JITlevel of medium. In addition, the exemplary JIT compilation historyabove indicates the JVM supporting the exemplary job above jitted thecall sequence for the foo method at a JIT level of ultra high. Readerswill note that the exemplary JIT compilation history above is forexplanation only and not for limitation.

The method of FIG. 7 also includes configuring (702), by the applicationmanager, the plurality of jobs (158) for execution on the plurality ofcompute nodes (600) in dependence upon the JIT compilation history (652)for the JVMs installed on the plurality of compute nodes (600). Theapplication manager configures (702) the plurality of jobs (158) forexecution on the plurality of compute nodes (600) according to themethod of FIG. 7 by performing (704) for at least one job (158) of theJava application (601): selecting (706), for that job, one of thecompute nodes (600) on which to execute that job (158) in dependenceupon the JIT compilation history (652) for the JVMs and at least onedesired JIT level (707) for that job (158); and configuring (710) thatjob (158) on the selected compute node (708) for execution.

The desired JIT levels (707) of FIG. 7 represent user-specified JITlevels for the various portions of each job (158) of the Javaapplication (601). The desired JIT levels (707) may be specified in aJIT profile for the application (601) that is provided by a systemadministrator or application developer. For example, consider thefollowing exemplary JIT profile:

TABLE 2 EXEMPLARY JIT PROFILE JOB IDENTIFIER JOB PORTION IDENTIFIER JITLEVEL 0 FooClass Medium 0 foo2 Medium 0 Foo Medium 0 Main Medium 0SomeOtherClass Medium 0 someOtherMethod Medium 0 while loop Medium 0Java Classes Medium 0 Java Methods Medium 0 Call Sequence foo Medium 1 .. . . . .

The exemplary JIT profile above specifies a desired JIT level of‘medium’ for each portion of job 0 in the exemplary application. Readerswill note that the exemplary JIT profile above is for explanation onlyand not for limitation.

In the method of FIG. 7, the application manager may select (706) one ofthe compute nodes (600) on which to execute a particular job (158) bycomparing the JIT compilation history (652) received from each of theJVMs with the desired JIT level (707) for the particular job (158) andselecting the node (708) having the JIT compilation history (652) thatbest matches the desired JIT level (707) for the particular job (158).The application manager may identify the best match as the compute nodeproviding a JIT compilation history (652) having the highest number ofjob portions that were previously jitted at a JIT level equal to orhigher than the desired JIT level (707) for those same job portions. Forexample, consider that both node 0 and node 1 have previously executedthe exemplary job above. Further consider that node 0 provides theapplication manager with the exemplary JIT compilation history in Table1 above and that node 1 provides the application manager with thefollowing exemplary JIT compilation history:

TABLE 3 EXEMPLARY JIT COMPILATION HISTORY JOB PORTION IDENTIFIER JITLEVEL FooClass Low foo2 Low foo Low main Low SomeOtherClass LowsomeOtherMethod Low while loop Low Java Classes Medium Java MethodsMedium Call Sequence foo Low

When comparing the desired JIT levels for the job portions in Table 2with the exemplary JIT compilations history in Tables 1 for node 0 andin Table 3 for node 1, the application manager determines that node 0provides a JIT compilation history having the highest number of jobportions that were previously jitted at a JIT level equal to or higherthan the desired JIT levels for those same job portions. Specifically,node 0 provides a JIT compilation history that includes 10 job portionsthat were jitted at JIT level equal to or higher than the desired JITlevels for those same job portions, while node 1 only provides a JITcompilation history that includes 2 job portions that were jitted at JITlevel equal to or higher than the desired JIT levels for those same jobportions.

Readers will note that selecting the node (708) having the JITcompilation history (652) that best matches the desired JIT level (707)for the particular job (158) in the manner described above is forexplanation only and not for limitation. In some other embodiments, theapplication manager may select the best match by taking into account thedegree by which a node jitted some job portions less than the desiredJIT levels in addition to the overall number of job portions jitted at alevel equal to or greater than the desired JIT levels. For example, onenode may have jitted all the portions of a job at a level slightly belowthe desired JIT levels while another node may jitted all the portions ofa job at a level significantly lower than the desired JIT level exceptfor a single job portion that was jitted at the desired level. Forperformance purposes in some applications, selecting the node thatjitted all the portions of a job at a level slightly below the desiredJIT levels may be more advantageous than selecting the node that jittedall the portions of a job at a level significantly lower than thedesired JIT level except for a single job portion that was jitted at thedesired level. Still further, readers will note that selecting the node(708) having the JIT compilation history (652) that best matches thedesired JIT level (707) for the particular job (158) may be carried outin other ways as will occur to those of skill in the art.

After selecting (706) the node (708) on which to execute a particularjob, the application manager may configure (710) that job (158) on theselected compute node (708) for execution according to the method ofFIG. 7 by instructing a service node to write the particular job intocomputer memory of the selected node (708) and instructing the servicenode to in turn instruct the selected node (708) to begin executing theparticular job (158) through that node's JVM. Although the configuringabove occurs through a service node, readers will note that in someembodiments the application manager may itself provide the job to theselected node (708) and instruct the compute node to begin execution.

As described above, in some embodiments, an application manager tracks aJIT compilation history for the JVMs installed on the compute nodes byreceiving the individual JIT compilation history from each of the JVMson the nodes. In such embodiments, the JVMs installed on the nodesrecord their individual JIT compilation histories for reporting to theapplication manager. For further explanation, therefore, consider FIG. 8that sets forth a flow chart illustrating a further exemplary method forexecuting a distributed Java application on a plurality of compute nodesaccording to embodiments of the present invention.

The method of FIG. 8 includes recording (800), by each JVM supporting atleast one job of the Java application on the plurality of compute nodes,the JIT compilation history (652) for the jobs supported by that JVM.Each JVM may record (800) the JIT compilation history (652) for the jobssupported by that JVM according to the method of FIG. 8 by logging inthe JVM's JIT compilation history (652) the portion of the job beingjitted and the JIT level at which that job portion is being jitting bythe JVM. In some embodiments, the JVM may determine the JIT level atwhich that job portion is jitted based on some user-specified JIT levelfor that particular job portion that the JVM retrieves from aconfiguration file for the job. In some other embodiments, the JVM maydetermine the JIT level at which that job portion is jitted based oncurrent or historical execution performance.

The method of FIG. 8 includes providing (802), by each JVM supporting atleast one job of the Java application on the plurality of compute nodes,the recorded JIT compilation history (652) to the application manager(125). Each JVM may provide (802) the recorded JIT compilation history(652) to the application manager (125) according to the method of FIG. 8by transmitting the recorded JIT compilation history (652) directly tothe application manager (125) across a data communications network. Inother embodiments, each JVM may provide (802) the recorded JITcompilation history (652) to the application manager (125) according tothe method of FIG. 8 by passing the recorded JIT compilation history(652) to a network monitor installed on the node with the JVM. Thenetwork monitor may then pass the recorded JIT compilation history (652)to the application manager (125) across a data communications network.In such a manner, the network monitor serves as a ‘local client’ for theapplication manager (125) on the node with the JVM. Upon receiving theJIT compilation histories (652), the application manager (125) may thenutilize the JIT compilation histories (652) in subsequent executions ofJava applications that include the jobs already jitted on the computenodes.

Exemplary embodiments of the present invention are described largely inthe context of a fully functional computer system for executing adistributed Java application on a plurality of compute nodes. Readers ofskill in the art will recognize, however, that the present inventionalso may be embodied in a computer program product disposed on computerreadable media for use with any suitable data processing system. Suchcomputer readable media may be transmission media or recordable mediafor machine-readable information, including magnetic media, opticalmedia, or other suitable media. Examples of recordable media includemagnetic disks in hard drives or diskettes, compact disks for opticaldrives, magnetic tape, and others as will occur to those of skill in theart. Examples of transmission media include telephone networks for voicecommunications and digital data communications networks such as, forexample, Ethernets™ and networks that communicate with the InternetProtocol and the World Wide Web as well as wireless transmission mediasuch as, for example, networks implemented according to the IEEE 802.11family of specifications. Persons skilled in the art will immediatelyrecognize that any computer system having suitable programming meanswill be capable of executing the steps of the method of the invention asembodied in a program product. Persons skilled in the art will recognizeimmediately that, although some of the exemplary embodiments describedin this specification are oriented to software installed and executingon computer hardware, nevertheless, alternative embodiments implementedas firmware or as hardware are well within the scope of the presentinvention.

It will be understood from the foregoing description that modificationsand changes may be made in various embodiments of the present inventionwithout departing from its true spirit. The descriptions in thisspecification are for purposes of illustration only and are not to beconstrued in a limiting sense. The scope of the present invention islimited only by the language of the following claims.

1. A method of executing a distributed software application on aplurality of compute nodes, the software application comprising aplurality of jobs distributed among the plurality of compute nodes, theplurality of compute nodes connected together for data communicationsthrough a data communication network, each of the plurality of computenodes having installed upon it a Virtual Machine (‘VM’) capable ofsupporting at least one job of the software application, the methodcomprising: tracking, by an application manager, a just-in-time (‘JIT’)compilation history for the VMs installed on the plurality of computenodes, wherein the JIT compilation history includes JIT levels forportions of the software application processed on the plurality ofcompute nodes; and configuring, by the application manager, theplurality of jobs for execution on the plurality of compute nodes independence upon the JIT compilation history for the VMs installed on theplurality of compute nodes.
 2. The method of claim 1 whereinconfiguring, by the application manager, the plurality of jobs forexecution on the plurality of compute nodes in dependence upon the JITcompilation history for the VMs installed on the plurality of computenodes further comprises performing for at least one job of the softwareapplication: selecting, for that job, one of the compute nodes on whichto execute that job in dependence upon the JIT compilation history forthe VMs and at least one desired JIT level for that job; and configuringthat job on the selected compute node for execution.
 3. The method ofclaim 1 wherein the JIT compilation history further comprises JIT levelsfor software a constructs processed on the plurality of compute nodes.4. The method of claim 1 wherein the JIT compilation history furthercomprises JIT levels for software a call sequences for particularsoftware a methods processed on the plurality of compute nodes.
 5. Themethod of claim 1 further comprising: recording, by each VM supportingat least one job of the software application on the plurality of computenodes, the JIT compilation history for the jobs supported by that VM;and providing, by each VM supporting at least one job of the softwareapplication on the plurality of compute nodes, the recorded JITcompilation history to the application manager.
 6. The method of claim 1wherein executing a distributed software a application on a plurality ofcompute nodes further comprises executing a distributed softwareapplication on a parallel computer, the parallel computer comprising theplurality of compute nodes and a service compute node, the applicationmanager installed upon the service compute node, the plurality ofcompute nodes connected for data communications through a plurality ofdata communications networks, at least one data communications networkoptimized for collective operations, and at least one other datacommunications network optimized for point to point operations.
 7. Acomputing system capable of executing a distributed softwareapplication, the computing system comprising a plurality of computenodes, the software application comprising a plurality of jobsdistributed among the plurality of compute nodes, the plurality ofcompute nodes connected together for data communications through a datacommunication network, each of the plurality of compute nodes havinginstalled upon it a Virtual Machine (‘VM’) capable of supporting atleast one job of the software application, the computing systemcomprising one or more computer processors and computer memoryoperatively coupled to the computer processors, the computer memoryhaving disposed within it computer program instructions capable of:tracking, by an application manager, a just-in-time (‘JIT’) compilationhistory for the VMs installed on the plurality of compute nodes, whereinthe JIT compilation history includes JIT levels for portions of thesoftware application processed on the plurality of compute nodes; andconfiguring, by the application manager, the plurality of jobs forexecution on the plurality of compute nodes in dependence upon the JITcompilation history for the VMs installed on the plurality of computenodes.
 8. The computing system of claim 7 wherein configuring, by theapplication manager, the plurality of jobs for execution on theplurality of compute nodes in dependence upon the JIT compilationhistory for the VMs installed on the plurality of compute nodes furthercomprises performing for at least one job of the software application:selecting, for that job, one of the compute nodes on which to executethat job in dependence upon the JIT compilation history for the VMs andat least one desired JIT level for that job; and configuring that job onthe selected compute node for execution.
 9. The computing system ofclaim 7 wherein the JIT compilation history further comprises JIT levelsfor software constructs processed on the plurality of compute nodes. 10.The computing system of claim 7 wherein the JIT compilation historyfurther comprises JIT levels for software call sequences for particularsoftware methods processed on the plurality of compute nodes.
 11. Thecomputing system of claim 7 wherein the computer memory has disposedwithin it computer program instructions capable of: recording, by eachVM supporting at least one job of the software application on theplurality of compute nodes, the JIT compilation history for the jobssupported by that VM; and providing, by each VM supporting at least onejob of the software application on the plurality of compute nodes, therecorded JIT compilation history to the application manager.
 12. Thecomputing system of claim 7 wherein executing a distributed softwareapplication on a plurality of compute nodes further comprises executinga distributed software application on a parallel computer, the parallelcomputer comprising the plurality of compute nodes and a service computenode, the application manager installed upon the service compute node,the plurality of compute nodes connected for data communications througha plurality of data communications networks, at least one datacommunications network optimized for collective operations, and at leastone other data communications network optimized for point to pointoperations.
 13. A computer program product for executing a distributedsoftware a application on a plurality of compute nodes, the softwareapplication comprising a plurality of jobs distributed among theplurality of compute nodes, the plurality of compute nodes connectedtogether for data communications through a data communication network,each of the plurality of compute nodes having installed upon it aVirtual Machine (‘VM’) capable of supporting at least one job of thesoftware application, the computer program product disposed upon acomputer readable medium, the computer readable medium not comprising asignal, the computer program product comprising computer programinstructions capable of: tracking, by an application manager, ajust-in-time (‘JIT’) compilation history for the VMs installed on theplurality of compute nodes, wherein the JIT compilation history includesJIT levels for portions of the software application processed pluralityof nodes; and configuring, by the application manager, the plurality ofjobs for execution on the plurality of compute nodes in dependence uponthe JIT compilation history for the VMs installed on the plurality ofcompute nodes.
 14. The computer program product of claim 13 whereinconfiguring, by the application manager, the plurality of jobs forexecution on the plurality of compute nodes in dependence upon the JITcompilation history for the VMs installed on the plurality of computenodes further comprises performing for at least one job of the softwarea application: selecting, for that job, one of the compute nodes onwhich to execute that job in dependence upon the JIT compilation historyfor the VMs and at least one desired JIT level for that job; andconfiguring that job on the selected compute node for execution.
 15. Thecomputer program product of claim 13 wherein the JIT compilation historyfurther comprises JIT levels for software constructs processed on theplurality of compute nodes.
 16. The computer program product of claim 13wherein the JIT compilation history further comprises JIT levels forsoftware a call sequences for particular software methods processed onthe plurality of compute nodes.
 17. The computer program product ofclaim 13 further comprising computer program instructions capable of:recording, by each VM supporting at least one job of the softwareapplication on the plurality of compute nodes, the JIT compilationhistory for the jobs supported by that VM; and providing, by each VMsupporting at least one job of the software application on the pluralityof compute nodes, the recorded JIT compilation history to theapplication manager.
 18. The computer program product of claim 13wherein executing a distributed software a application on a plurality ofcompute nodes further comprises executing a distributed software aapplication on a parallel computer, the parallel computer comprising theplurality of compute nodes and a service compute node, the applicationmanager installed upon the service compute node, the plurality ofcompute nodes connected for data communications through a plurality ofdata communications networks, at least one data communications networkoptimized for collective operations, and at least one other datacommunications network optimized for point to point operations. 19.(canceled)
 20. (canceled)